منابع مشابه
Searching for Chess
Chess programs have three major components: move generation, search, and evaluation. All components are important, although evaluation with its quiescence analysis is the part which makes each program's play unique. The speed of a chess program is a function of its move generation cost, the complexity of the position under study and the brevity of its evaluation. More important, however, is the...
متن کاملSearching to Variable Depth in Computer Chess
This paper discusses some methods for guiding the search of conventional chess programs to variable depth. The motivation for investigating such methods comes from the fact that searching to a fixed depth causes difficult problems (e.g. the horizon effect). The first section deals with certain improvements of the quiescence search and a demonstration of their beneficial effects. The method of n...
متن کاملSearching for Better Performance on the King-Rook-King Chess Endgame Problem
For many classification problems, genetic algorithms prove to be effective without extensive domain engineering. However, the chess King-Rook-King endgame problem appears to be an exception. We explore whether modifications to a baseline parallel genetic algorithm can improve the accuracy on this particular problem. After describing the problem domain and our implementation of a parallel geneti...
متن کاملManagement accounting research methodologies: searching for the bests
Management needs qualitative and comprehensive information for decision making. Managers are always searching for useful information in order to reach their firm's goals and strategies. The development in technology, globalization and focusing on costumers needs has changed the information that managers need to maintain their position in a competitive environment and take advantage of profitabl...
متن کاملSmooth Chess
We will attempt to find a smooth version of the classical (discrete) game of chess. Defined rigorously below, a smooth version of a game is in some sense reminiscent of the probability distributions discussed in quantum mechanics, in the sense that a piece is not necessarily concentrated in one place, but distributed throughout the board. For example, if a player believes that there is a 30% ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ICGA Journal
سال: 1987
ISSN: 2468-2438,1389-6911
DOI: 10.3233/icg-1987-10309